On eigenvalues of real symmetric interval matrices: Sharp bounds and disjointness
نویسندگان
چکیده
In this paper, the eigenvalue problem of real symmetric interval matrices is studied. First, in case $2 \times 2$ matrices, all four endpoints two intervals are determined. These not necessarily eigenvalues vertex but it shown that such a matrix can be constructed from original one. Then, necessary and sufficient conditions provided for disjointness intervals. general $n\times n$ case, due to Hertz, set special determines maximal similar statement holds minimal namely if right off-diagonal smaller than absolute value left ones, he concluded provides eigenvalue. Generalizing it, with sign pattern, single one extremal bounds.
منابع مشابه
Bounds on Real Eigenvalues and Singular Values of Interval Matrices
We study bounds on real eigenvalues of interval matrices, and our aim is to develop fast computable formulae that produce as-sharp-as-possible bounds. We consider two cases: general and symmetric interval matrices. We focus on the latter case, since on one hand such interval matrices have many applications in mechanics and engineering, and on the other many results from classical matrix analysi...
متن کاملBounds on the Extreme Eigenvalues of Real Symmetric Toeplitz Matrices
We derive upper and lower bounds on the smallest and largest eigenvalues, respectively, of real symmetric Toeplitz matrices. The bounds are rst obtained for positive-deenite matrices and then extended to the general real symmetric case. Our bounds are computed as the roots of rational and polynomial approximations to spectral, or secular, equations. The decomposition of the spectrum into even a...
متن کاملEigenvalues of symmetric tridiagonal interval matrices revisited
In this short note, we present a novel method for computing exact lower and upper bounds of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and avoids any assumptions Our construction explicitly yields those matrices for which particular lower and upper bounds are attained.
متن کاملAnalysis of Eigenvalue Bounds for Real Symmetric Interval Matrices
In this paper, we present several verifiable conditions for eigenvalue intervals of real symmetric interval matrices overlapping or not overlapping. To above cases, two new methods with algorithms for computing eigenvalue bounds of real symmetric matrices are developed. We can estimate eigenvalue bounds moving away the assumption that two intervals containing two eigenvalues of real symmetric i...
متن کاملReal symmetric matrices 1 Eigenvalues and eigenvectors
A matrix D is diagonal if all its off-diagonal entries are zero. If D is diagonal, then its eigenvalues are the diagonal entries, and the characteristic polynomial of D is fD(x) = ∏i=1(x−dii), where dii is the (i, i) diagonal entry of D. A matrix A is diagonalisable if there is an invertible matrix Q such that QAQ−1 is diagonal. Note that A and QAQ−1 always have the same eigenvalues and the sam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Linear Algebra
سال: 2023
ISSN: ['1081-3810', '1537-9582']
DOI: https://doi.org/10.13001/ela.2022.7317